Timed Planning
نویسندگان
چکیده
Planning has been at the forefront of research in the areas of Artificial Intelligence and cognitive science. High-level action description languages (e.g., language A) have been used to specify, verify and diagnose plans. Timed Planning is planning under real-time constraints. To specify timed planning problems, an extension of the action description language A with real-time stopwatches, called AT has been used. In this paper, we show how timed planning domains (described in AT ) can be easily and elegantly encoded as answer set programs extended with constraints over reals.
منابع مشابه
Timed Transition Automata as Numerical Planning Domain
A general technique for transforming a timed finite state automaton into an equivalent automated planning domain based on a numerical parameter model is introduced. Timed transition automata have many applications in control systems and agents models; they are used to describe sequential processes, where actions are labelling by automaton transitions subject to temporal constraints. The languag...
متن کاملAutomated Composition of Timed Services by Planning as Model Checking
Techniques of automated service composition can shorten development time by generating a concrete service composition out of a set of abstract composition requirements. However, no existing fully automated approach is able to deal with timed services and timed composition requirements. In this work, we propose an approach for the automated composition of timed services, represented as timed i/o...
متن کاملMapping Temporal Planning Constraints into Timed Automata
Planning and Model Checking are similar in concept. They both deal with reaching a goal state from an initial state by applying specified rules that allow for the transition from one state to another. Exploring the relationship between them is an interesting new research area. We are interested in planning frameworks that combine both planning and scheduling. For that, we focus our attention on...
متن کاملPlanning Robust Temporal Plans; A Comparison Between Constraints Based Temporal Planning and Timed Game Automata Approaches
Planning for real world applications, with explicit temporal representation and a robust execution is a very challenging problem. To tackle it, the planning community has proposed a number of original and successful approaches. However, there are other paradigms “outside” the Automated Planning field which may prove to be successful with respect to this objective. This paper presents a comparis...
متن کاملSolving Planning Problems Using Real-Time Model Checking (Translating PDDL3 into Timed Automata)
We present a translation for the variant PDDL 3 of PDDL (Planning Domain Definition Language) into Timed Automata. The advantage of having such a translation is the availability of tool support by modelcheckers. We present a case study in which we apply a version of UPPAAL that has been extended for the search of cost-optimal solutions.
متن کامل